Efficient algorithms for electric vehicles’ min-max routing problem

An increase in greenhouse gases emission from the transportation sector has led companies and government to elevate support production of electric vehicles (EV). With recent developments urbanization e-commerce, are replacing their conventional fleet with EVs strengthen efforts for sustainable environment-friendly operations. However, deploying a asks efficient routing recharging strategies alleviate limited range mitigate battery degradation rate. In this work, is considered logistic capabilities capacity scarce charging station availability. We introduce min-max vehicle problem (MEVRP) where maximum distance traveled by any EV minimized while considering stations recharging. propose an branch cut framework three-phase hybrid heuristic algorithm that can efficiently solve variety instances. Extensive computational results sensitivity analyses performed corroborate efficiency proposed approach, both quantitatively qualitatively. Finally data-driven simulation implemented robot operating system (ROS) middleware